Adaptive optimisation of noisy black-box functions inherent in microscopic models
نویسندگان
چکیده
For systems where exact constitutive relations are unknown, a microscopic level description can be alternatively used. As microscopic imulations are computationally expensive, there is a need for the development of robust algorithms in order to efficiently optimise such systems aking into consideration the inherent noise associated with the microscopic description. Three optimisation strategies are proposed and tested sing a stochastic reaction system as a case study. The first method generates optimal difference intervals to formulate and solve a non-linear rogram (NLP), whereas the other methods build response surface models and optimise using either a direct search algorithm changing to a teepest descent method once the optimum region is located, or sequential quadratic programming (SQP). The performance of these methods is ompared to that of a steepest descent optimisation method commonly used for response surfaces. Their effectiveness is evaluated in terms of the umber of microscale function calls and computational time. 2006 Elsevier Ltd. All rights reserved.
منابع مشابه
Adaptive Optimization of Noisy Black-Box Functions Inherent In Microscopic Models
For stochastic systems where exact constitutive relations are unknown, a microscopic or molecular level description can be alternatively used. As microscopic simulations are computationally very expensive, there is a need for the development of robust algorithms capable of economically optimizing these noisy processes. In this paper, two approaches – an adaptive strategy using a gradient-based ...
متن کاملUse of quadratic models with mesh-adaptive direct search for constrained black box optimization
We consider derivative-free optimization, and in particular black box optimization, where the functions to minimize and the functions representing the constraints are given by black boxes without derivatives. Two fundamental families of methods are available: Model-based methods and directional direct search algorithms. This work exploits the flexibility of the second type of method in order to...
متن کاملAdaptive Bayesian Optimisation for Online Portfolio Selection
We present a Bayesian approach for online portfolio selection, a fundamental problem in computational finance. We pose the problem as the global optimisation of an expensive, time-varying, black-box function. As the optimum is itself dynamic, we use a model that allows us to capture time-dependent patterns of the function and to provide sequential decision processes that enable us to select opt...
متن کاملBlack-box optimization of noisy functions with unknown smoothness
We study the problem of black-box optimization of a function f of any dimension, given function evaluations perturbed by noise. The function is assumed to be locally smooth around one of its global optima, but this smoothness is unknown. Our contribution is an adaptive optimization algorithm, POO or parallel optimistic optimization, that is able to deal with this setting. POO performs almost as...
متن کاملBBOB 2009: Comparison Tables of All Algorithms on All Noisy Functions
This document presents the results in the form of tables from the Black-Box Optimization Benchmarking (BBOB) workshop of the Genetic and Evolutionary Computation Conference (GECCO), Montreal Canada, 2009. Each table presents the comparative performances of the algorithms submitted to BBOB 2009 on one problem from the noisy function testbed. Key-words: continuous optimization, benchmarking Anne ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Chemical Engineering
دوره 31 شماره
صفحات -
تاریخ انتشار 2007